<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    179. Largest Number
   </h1>
   <p>
    Given a list of non negative integers, arrange them such that they form the largest number.
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> <code>[10,2]</code>
<strong>Output:</strong> "<code>210"</code></pre>
   <p>
    <strong>
     Example 2:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> <code>[3,30,34,5,9]</code>
<strong>Output:</strong> "<code>9534330"</code>
</pre>
   <p>
    <strong>
     Note:
    </strong>
    The result may be very large, so you need to return a string instead of an integer.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    179. 最大数
   </h1>
   <p>
    给定一组非负整数，重新排列它们的顺序使之组成一个最大的整数。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>[10,2]</code>
<strong>输出:</strong> <code>210</code></pre>
   <p>
    <strong>
     示例&nbsp;2:
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>[3,30,34,5,9]</code>
<strong>输出:</strong> <code>9534330</code></pre>
   <p>
    <strong>
     说明:
    </strong>
    输出结果可能非常大，所以你需要返回一个字符串而不是整数。
   </p>
  </div>
 </body>
</html>